Covering a Set of Line Segments with a Few Squares
نویسندگان
چکیده
We study three covering problems in the plane. Our original motivation for these come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up four unit-sized, axis-parallel squares. second build data structure on efficiently answer any query subtrajectory coverable unit-sized third problem compute longest that two
منابع مشابه
Covering Segments with Unit Squares
We study several variations of line segment covering problem with axis-parallel unit squares in IR. A set S of n line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملA linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
This paper discusses the problem of covering and hitting a set of line segments L in R by a pair of axis-parallel squares such that the side length of the larger of the two squares is minimized. We also discuss the restricted version of covering, where each line segment in L is to be covered completely by at least one square. The proposed algorithm for the covering problem reports the optimum r...
متن کاملEvery Set of Disjoint Line Segments Admits a Binary
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a tree with the endpoints of the segments such that each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist conngurations of line segments where any such tree requires degree 3. We provide an O(n log n) time a...
متن کاملβ-skeletons for a Set of Line Segments in R2
We generalize β-skeletons, well-known neighborhood graphs for point sets, to sets of line segments and present algorithms for computing such skeletons, both circle and lens-based, for the entire range of β values. In particular, for β ≥ 1 the β-skeleton for a set S on n segments in the Euclidean plane can be constructed in O(nα(n) log n) time and the construction relies on the Delaunay triangul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-75242-2_20